منابع مشابه
Monte-Carlo algorithms in graph isomorphism testing
Abstract. We present an O(V 4 log V ) coin flipping algorithm to test vertex-colored graphs with bounded color multiplicities for color-preserving isomorphism. We are also able to generate uniformly distributed random automorphisms of such graphs. A more general result finds generators for the intersection of cylindric subgroups of a direct product of groups in O(n7/2 log n) time, where n is th...
متن کاملFast Algorithm for Graph Isomorphism Testing
In this paper we present a novel approach to the graph isomorphism problem. We combine a direct approach, that tries to find a mapping between the two input graphs using backtracking, with a (possibly partial) automorphism precomputing that allows to prune the search tree. We propose an algorithm, conauto, that has a space complexity of O(n log n) bits. It runs in time O(n) with high probabilit...
متن کاملGraph isomorphism testing boosted by path coloring
A method for improving the efficiency of graph isomorphism testing is presented. The method uses the structure of the graph colored by vertex hash codes as a means of partitioning vertices into equivalence classes, which in turn reduces the combinatorial burden of isomorphism testing. Unrolling the graph into a tree at each vertex allows structurally different regular graphs to be discriminated...
متن کاملIsomorphism Testing via Polynomial-Time Graph Extensions
This paper deals with algorithms for detecting graph isomorphism (GI) properties. The GI literature consists of numerous research directions, from highly theoretical studies (e.g. defining the GI complexity class) to very practical applications (pattern recognition, image processing). We first present the context of our work and provide a brief overview of various algorithms developed in such d...
متن کاملPolynomial Time Algorithm for Graph Isomorphism Testing
Earlier we introduced (M.I.Trofimov, E.A.Smolenskii, Application of the Electronegativity Indices of Organic Molecules to Tasks of Chemical Informatics, Russian Chemical Bulletin 54(2005), 2235-2246. http://dx.doi.org/10.1007/s11172-006-0105-6) effective recursive algorithm for graph isomorphism testing. In this paper we describe used approach and iterative modification of this algorithm, which...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Computing
سال: 2008
ISSN: 0097-5397,1095-7111
DOI: 10.1137/070680795